Algorithms for Fast Vector Quantizaton

نویسندگان

  • Sunil Arya
  • David M. Mount
چکیده

Nearest neighbor searching is an important geometric subproblem in vector quanti-zation. Existing studies have shown that the diiculty of solving this problem eeciently grows rapidly with dimension. Indeed, existing approaches on unstructured codebooks in dimension 16 are little better than brute-force search. We show that if one is willing to relax the requirement of nding the true nearest neighbor then dramatic improvements in running time are possible, with negligible degradation in the quality of the result. We present an empirical study of three nearest neighbor algorithms on a number of data distributions, and in dimensions varying from 8 to 16. The rst algorithm is the standard k-d tree algorithm which has been enhanced to use incremental distance calculation, the second is a further improvement that orders search by the proximity of the k-d cell to the query point, and the third is based on a simple greedy search in a structure called a neighborhood graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms

Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...

متن کامل

Average Complexity Analysis of Scalar Quantizer design

In this paper an exact and complete analysis of average design complexities of Lloyd-Max's scalar quantizers, scalar compandors and scalar quantizers designed using the hybrid model is carried out. The average design complexity depends on arithmetic complexity, memory complexity and implementation complexity. It is demonstrated that for a fixed number of quantizaton levels N, scalar compandors ...

متن کامل

New Fast Algorithms for First-Order Linear Recurrences on Vector Computers

We examine the performance of parallel algorithms for rst-order linear recurrence on vector computers, evaluate them quantitatively on a simple model of vector computers, and propose new fast algorithms. We also show a result of performance benchmarking of them on actual vector computers.

متن کامل

Subband Image Coding Using Entropy-Constrained Residual Vector Quantizaton

An entropy-constrained residual vector quantization design algorithm is used to design codebooks for image coding. Entropy-constrained residual vector quantization has several important advantages. It can outperform entropy-constrained vector quantization in terms of rate-distortion performance, memory, and computation requirements. It can also be used to design vector quantizers with relativel...

متن کامل

Adaptation of Rejection Algorithms for a Radar Clutter

In this paper, the algorithms for adaptive rejection of a radar clutter are synthesized for the case of a priori unknown spectral-correlation characteristics at wobbulation of a repetition period of the radar signal. The synthesis of algorithms for the non-recursive adaptive rejection filter (ARF) of a given order is reduced to determination of the vector of weighting coefficients, which realiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993